On The Exact Security of Message Authentication Using Pseudorandom Functions
نویسندگان
چکیده
منابع مشابه
On The Exact Security of Message Authentication Using Pseudorandom Functions
Traditionally, modes of Message Authentication Codes(MAC) such as Cipher Block Chaining (CBC) are instantiated using block ciphers or keyed Pseudo Random Permutations(PRP). However, one can also use domain preserving keyed Pseudo Random Functions(PRF) to instantiate MAC modes. The very first security proof of CBC-MAC [BKR00], essentially modeled the PRP as a PRF. Until now very little work has ...
متن کاملXOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
We describe a new approach for authenticating a message using a finite pseudorandom function (PRF). Our "XOR MACs" have several nice features, including parallelisability, incrementality, and provable security. The finite PRF can be "instantiated" via DES (yielding an alternative to the CBC MAC), via the compression function of MD5 (yielding an alternative to various "keyed MD5" constructions),...
متن کاملthe impact of using inspirational quotes on abstract vocabulary recall
the present study is an attempt to investigate the potential impact of inspirational quotes on improving english abstract vocabulary recall. to achieve this goal, a multiple choice language proficiency test of 60 items including vocabulary and grammar component was administered to a sample of 63 second-semester male and female students whose age ranged between 17 to 22 and they were studying en...
15 صفحه اولOn the Security of Iterated Message Authentication Codes
The security of iterated message authentication code (MAC) algorithms is considered, and in particular those constructed from unkeyed hash functions. A new MAC forgery attack applicable to all deterministic iterated MAC algorithms is presented, which requires on the order of 2n=2 known text-MAC pairs for algorithms with n bits of internal memory, as compared to the best previous general attack ...
متن کاملOn the Security of Cipher Block Chaining Message Authentication Code
In [4], Bernstein presented a simple proof of security of Cipher Block Chaining (CBC) Message Authentication Code (MAC) against adversaries querying messages all of which are of the same length. In this paper we show that Bernstein’s proof can be used to prove security of CBC MAC against adversaries querying non-empty messages that are not prefixes of each other. This implies that “length-prepe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR Transactions on Symmetric Cryptology
سال: 2017
ISSN: 2519-173X
DOI: 10.46586/tosc.v2017.i1.427-448